Algorithm 8xx: AMD, an approximate minimum degree ordering algorithm
نویسندگان
چکیده
AMD is a set of routines for permuting sparse matrices prior to numerical factorization, using the approximate minimum degree ordering algorithm. There are versions written in both C and Fortran 77. A MATLAB interface is included.
منابع مشابه
An Approximate Minimum Degree Ordering Algorithm
An Approximate Minimum Degree ordering algorithm (AMD) for preordering a symmetric sparse matrix prior to numerical factorization is presented. We use techniques based on the quotient graph for matrix factorization that allow us to obtain computationally cheap bounds for the minimum degree. We show that these bounds are often equal to the actual degree. The resulting algorithm is typically much...
متن کاملDynamic Pivoting by Shcur Decomposition Based Method for GLU Solver
This document presents the Schur-decomposition based dynamic pivoting method for GLU solver. The new pivoting method allows dynamic pivoting for small number of small valued pivots after the AMD (approximate minimum degree) ordering process and the symbolic analysis process in the GLU, which is similar to the left-looking method. This method will not be very effective if there is a large number...
متن کاملToward an Efficient Column Minimum Degree Code for Symmetric Multiprocessors
Ordering the columns of a nonsymmetric sparse matrix can reduce the fill created in its factorization. Minimum-degree is a popular heuristic for ordering symmetric matrices; a variant that can be used to order nonsymmetric matrices is called column minimum degree. In this paper we describe the design of a multithreaded approximate column minimum degree code. We present a framework for the algor...
متن کاملHybridizing Nested Dissection and
Minimum degree and nested dissection are the two most popular reordering schemes used to reduce ll-in and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete nested dissection and ordering by minimum degree the subgraphs associated with the leaves of the separation tree, but most often only l...
متن کاملHybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering
Minimum Degree and Nested Dissection are the two most popular reordering schemes used to reduce ll-in and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete Nested Dissection and ordering by Minimum Degree the subgraphs associated with the leaves of the separation tree, but to date only loos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003